A Concise Tour of Communication Complexity Theory
نویسندگان
چکیده
منابع مشابه
Complexity - A Guided Tour
What enables individually simple insects like ants to act with such precision and purpose as a group? How do trillions of neurons produce something as extraordinarily complex as consciousness? In this remarkably clear...
متن کاملConcise Tour to the Virtual Old Prague
This paper describes a structure and a user interface of the Internet based 3D presentation of existing historical part of city Prague. The application offers a smooth tour to selected regions of the real city, utilizing number of standard and modern technologies including VRML, Java, and PHP. The architecture of the whole virtual model is presented together with several advanced and specific f...
متن کاملCommunication and culture: A complexity theory approach
In the target paper, Kashima (2014) harvests insights from communication research, shared reality theory in social psychology, diffusionism in cognitive anthropology and connectionism in cognitive psychology to propose a neodiffusionist account of culture. A major contribution of this account is that it offers a social psychological explanation of the formation, maintenance, and transformation ...
متن کاملConsensus in Asynchronous Distributed Systems: A Concise Guided Tour
It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It studies Consensus in two failure models, namely, the Crash/no Recovery model and the Crash/Recovery model. The assumptions related to the detection of failures that are required to solve Consensus in...
متن کاملPublications in Communication Complexity Theory
This pair of papers contains lower bounds in the “number-on-forehead” (NOF) model of multi-party communication complexity that remain the strongest even to date, after 24 years, in spite of considerable effort. The paper includes applications to a variety of models of computation: time-space tradeoff for multi-head Turing machines, lower bounds for branching programs, pseudorandom generators fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE ESS Fundamentals Review
سال: 2016
ISSN: 1882-0875
DOI: 10.1587/essfr.10.1_46